#include<bits/stdc++.h>
#define int long long
#define ls(x) ((x)*2)
#define rs(x) ((x)*2+1)
#define Debug(...) fprintf(stderr, __VA_ARGS__)
#define For(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define Rof(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
#define rep(i,  b) for(int i=1,i##end=b;i<=i##end;i++)
using namespace std;
const int N=1e6+5,base=999983,Mod=111121;
//char buf[(1<<21)+5],*p1,*p2;
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
inline void chmx(int &x,int y){(x<y)&&(x=y);}
inline void chmn(int &x,int y){(x>y)&&(x=y);}
inline void Add(int &x,int y){(x=x+y+Mod)%=Mod;}
inline int read(){
	int f=0,x=0;
	char ch=getchar();
	while(!isdigit(ch)){f|=(ch=='-');ch=getchar();}
	while(isdigit(ch)){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
	return f?-x:x;
}
void print(int n){
    if(n<0){
        putchar('-');
        n*=-1;
    }
    if(n>9) print(n/10);
    putchar(n%10+'0');
}
inline int ksm(int a,int b){
	int res=1;
	while(b){
		if(b&1) res=res*a%Mod;
		a=a*a%Mod;
		b>>=1;
	}
	return res;
}
int n;
int a[N];
vector<int>q[N];
int dep[N],fa[N];
void dfs(int x,int faz){
	dep[x]=dep[faz]+1;fa[x]=faz;
	for(auto y:q[x]){
		if(y== faz) continue;
		dfs(y,x);
	}
} 
signed main(){
	freopen("abstract.in","r",stdin);
	freopen("abstract.out","w",stdout);
	// ios::sync_with_stdio(false);
	// cin.tie(0); cout.tie(0);
	n=read();
	For(i,1,n) a[i]=read();
	For(i,1,n-1){
		int u=read(),v=read();
		q[u].push_back(v),q[v].push_back(u);
	}
	dfs(1,0);
	int ans=0;
	For(U,1,n){
		For(V,U,n){
			int u=U,v=V;
			int f=(a[u]&a[v]),g=(a[u]|a[v]);
			while(u!=v){
				if(dep[u]<dep[v] )swap(u,v);
				u=fa[u];
				f&=a[u];
				g|=a[u];
			}
			if(f!=0&&g!=0)ans+=ksm(f,g);
			ans%=Mod;
//			cout<<U<<" "<<V<<" "<<ksm(f,g)<<endl;
		}
	}
	printf("%lld\n",ans);
#ifdef LOCAL
    Debug("\nMy Time: %.3lfms\n", (double)clock() / CLOCKS_PER_SEC);
#endif
	return 0;
}

